FLAT-Net: Longitudinal Brain Graph Evolution Prediction from a Few Training Representative Templates

نویسندگان

چکیده

Diagnosing brain dysconnectivity disorders at an early stage amounts to understanding the evolution of such abnormal connectivities over time. Ideally, without resorting collecting more connectomic data time, one would predict disease with high accuracy. At this point, generative learning models from limited can come into play time a single acquisition timepoint. Here, we aim bridge gap between scarcity and prediction by proposing our novel Few-shot LeArning Training Network (FLAT-Net), first framework leveraging few-shot paradigm for connectivity baseline To do so, introduce concept representative connectional templates (CBTs), which encode most centered features (i.e., connectivities) given population networks. Such CBTs capture well heterogeneity diversity, hence they train predictive model in frugal but generalizable manner. More specifically, FLAT-Net starts clustering k clusters using renowned K-means method. Then, each cluster homogenous networks, create CBT, call specific-CBT (cs-CBT). We solely use cs-CBT distinct geometric adversarial network (gGAN) clusters, extract cs-CBTs, gGANs (sub-model) cs-CBT) learn testing stage, compute Euclidean distance subject cs-CBT, select gGAN trained on closest prediction. A series benchmarks against variants excised interpretations showed that proposed FLAT-Net, training strategy, sub-model selection are promising strategies predicting longitudinal alterations only few templates. Our code is available https://github.com/basiralab/FLAT-Net.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Cutting a Few Vertices from a Graph

We consider the problem of 0nding in an undirected graph a minimum cut that separates exactly a given number k of vertices. For general k (i.e. k is part of the input and may depend on n) this problem is NP-hard. We present for this problem a randomized approximation algorithm, which is useful when k is relatively small. In particular, for k = O(log n) we obtain a polynomial time approximation ...

متن کامل

Reusable Graph Transformation Templates

Model-Driven Engineering promotes models as the principal artefacts of the development, hence model transformation techniques – like graph transformation – become key enablers for this development paradigm. In order to increase the adoption of Model-Driven Engineering in industrial practice, techniques aimed at raising the quality and productivity in model transformation development are needed....

متن کامل

Learning Pedagogical Policies from Few Training Data

Learning a pedagogical policy in an Adaptive Educational System (AIES) fits as a Reinforcement Learning (RL) problem. However, to learn pedagogical policies requires to acquire a huge amount of experience interacting with the students, so applying RL to the AIES from scratch is infeasible. In this paper we describe RLATES, an AIES that uses RL to learn an accurate pedagogical policy to teach a ...

متن کامل

Graph drawings with few slopes

The slope-number of a graph G is the minimum number of distinct edge slopes in a straight-line drawing of G in the plane. We prove that for ∆ ≥ 5 and all large n, there is a ∆-regular n-vertex graph with slope-number at least n1− 8+ε ∆+4 . This is the best known lower bound on the slope-number of a graph with bounded degree. We prove upper and lower bounds on the slope-number of complete bipart...

متن کامل

A prediction approach to representative sampling

After a discussion on the historic evolvement of the concept of representative sampling in official statistics, we propose a prediction approach to it. 1 The birth of representative method The word birth should not be taken literally, as there are many fathers and few (if any) mothers involved in the process. As a matter of fact, social and demographic statistics emerged as a result of partial ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Lecture Notes in Computer Science

سال: 2021

ISSN: ['1611-3349', '0302-9743']

DOI: https://doi.org/10.1007/978-3-030-87602-9_25